Ramsey’s theorem in stable structures
نویسندگان
چکیده
We prove some results on the border of Ramsey theory (finite partition calculus) and model theory. In particular, we demonstrate bounds on the size of finite sets that assure the existence therein of sequences indiscernible with respect to a formula and how those bounds are improved by stability assumptions.
منابع مشابه
The Metamathematics of Stable Ramsey’s Theorem for Pairs
We show that, over the base theory RCA0, Stable Ramsey’s Theorem for Pairs implies neither Ramsey’s Theorem for Pairs nor Σ2-induction.
متن کاملThe polarized Ramsey's theorem
We study the effective and proof-theoretic content of the polarized Ramsey’s theorem, a variant of Ramsey’s theorem obtained by relaxing the definition of homogeneous set. Our investigation yields a new characterization of Ramsey’s theorem in all exponents, and produces several combinatorial principles which, modulo bounding for Σ2 formulas, lie (possibly not strictly) between Ramsey’s theorem ...
متن کاملRamsey’s Theorem for Singletons and Strong Computable Reducibility
We answer a question posed by Hirschfeldt and Jockusch by showing that whenever k > `, Ramsey’s theorem for singletons and k-colorings, RTk, is not strongly computably reducible to the stable Ramsey’s theorem for `-colorings, SRT` . Our proof actually establishes the following considerably stronger fact: given k > `, there is a coloring c : ω → k such that for every stable coloring d : [ω]2 → `...
متن کاملStable Ramsey's Theorem and Measure
The stable Ramsey’s theorem for pairs has been the subject of numerous investigations in mathematical logic. We introduce a weaker form of it by restricting from the class of all stable colorings to subclasses of it that are non-null in a certain effective measure-theoretic sense. We show that the sets that can compute infinite homogeneous sets for non-null many computable stable colorings and ...
متن کاملCappable Cea Sets and Ramsey’s Theorem
We begin a search for degree-theoretic properties that might be used to separate Ramsey’s Theorem for pairs from its stable version in the Reverse Mathematical sense. This paper introduces the notion of c-cappability and shows that this property cannot be used to obtain such a separation when combined with
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997